-
1 Gries algorithm
матем. алгоритм ГрайзаБольшой англо-русский и русско-английский словарь > Gries algorithm
-
2 Gries algorithm
<math.> алгоритм Грайза -
3 Gries algorithm
матем. -
4 algorithm
-
5 algorithm
1) алгоритм
2) алгорифм
– addition algorithm
– algorithm concatenation
– almost-dual algorithm
– by an algorithm
– compilation algorithm
– computational algorithm
– control algorithm
– controller algorithm
– decoding algorithm
– deterministic algorithm
– develop algorithm
– execution algorithm
– full-memory algorithm
– generalized algorithm
– Gries algorithm
– McCluskey algorithm
– partial-memory algorithm
– pattern-recognition algorithm
– pertaining to an algorithm
– Post algorithm
– recursive algorithm
– scheduling algorithm
– self-adaptive algorithm
– sequential algorithm
– shuttle algorithm
– synthesize algorithm
– table algorithm
– translation algorithm
-
6 алгоритм Грайза
матем. Gries algorithmБольшой англо-русский и русско-английский словарь > алгоритм Грайза
См. также в других словарях:
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Edsger W. Dijkstra — Edsger Wybe Dijkstra Born May 11, 1930(1930 05 11) Rotterdam, Netherl … Wikipedia
Computer science — or computing science (abbreviated CS) is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems. Computer scientists invent algorithmic… … Wikipedia
Coders at work — Coders at Work: Reflections on the Craft of Programming Author(s) Peter Seibel … Wikipedia
Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… … Wikipedia
Donald B. Johnson — Donald Bruce Johnson (died 1994)[1][2] was an American computer scientist, a researcher in the design and analysis of algorithms, and the founding chair of the computer science department at Dartmouth College.[3] Johnson received his Ph.D. from… … Wikipedia
Structured programming — can be seen as a subset or subdiscipline of procedural programming, one of the major programming paradigms. It is most famous for removing or reducing reliance on the GOTO statement.Historically, several different structuring techniques or… … Wikipedia
Dartmouth ALGOL 30 — was an implementation, firstly of ALGOL 58, then of ALGOL 60 for the LGP 30 at Dartmouth College, hence the name. Since the limited size of the LGP 30 precluded a full implementation of ALGOL 60, certain of its features (arrays called by value,… … Wikipedia
Read-only Turing machine — A read only Turing machine or Two way deterministic finite state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape.… … Wikipedia
